Mapping, Ii 13.1. Practical Sts Mapping 13.1.1. a Model of Sts Mapping with Errors

The previous mapping lecture demonstrated how, in the absence of errors, STS mapping could be solved efficiently via a reduction to a well-known abstract problem called the consecutive-ones problem. The solution made use of a data structure called a PQ-tree which eloquently represents all possible orderings of the STS sites that are consistent with the data. The flaw in this approach, however, is that it is not tolerant of the experimental error found in real instances of the STS mapping problem.